Crossover or Mutation?
نویسنده
چکیده
Genetic algorithms rely on two genetic operators crossover and mutation. Although there exists a large body of conventional wisdom concerning the roles of crossover and mutation, these roles have not been captured in a theoretical fashion. For example, it has never been theoretically shown that mutation is in some sense "less powerful" than crossover or vice versa. This paper provides some answers to these questions by theoretically demonstrating that there are some important characteristics of each operator that are not captured by the other.
منابع مشابه
Multi-Objective Optimization of Solar Thermal Energy Storage Using Hybrid of Particle Swarm Optimization and Multiple Crossover and Mutation Operator
Increasing of net energy storage (Q net) and discharge time of phase change material (t PCM), simultaneously, are important purpose in the design of solar systems. In the present paper, Multi-Objective (MO) based on hybrid of Particle Swarm Optimization (PSO) and multiple crossover and mutation operator is used for Pareto based optimization of solar systems. The conflicting objectives are Q net...
متن کاملOPTIMIZATION OF STEEL MOMENT FRAME BY A PROPOSED EVOLUTIONARY ALGORITHM
This paper presents an improved multi-objective evolutionary algorithm (IMOEA) for the design of planar steel frames. By considering constraints as a new objective function, single objective optimization problems turned to multi objective optimization problems. To increase efficiency of IMOEA different Crossover and Mutation are employed. Also to avoid local optima dynamic interference of mutat...
متن کاملA Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کاملAdapting Crossover and Mutation Rates in Genetic Algorithms
It is well known that a judicious choice of crossover and/or mutation rates is critical to the success of genetic algorithms. Most earlier researches focused on finding optimal crossover or mutation rates, which vary for different problems, and even for different stages of the genetic process in a problem. In this paper, a generic scheme for adapting the crossover and mutation probabilities is ...
متن کاملOn Mutation and Crossover in the Theory of Evolutionary Algorithms
The Evolutionary Algorithm is a population-based metaheuristic optimization algorithm. The EA employs mutation, crossover and selection operators inspired by biological evolution. It is commonly applied to find exact or approximate solutions to combinatorial search and optimization problems. This dissertation describes a series of theoretical and experimental studies on a variety of evolutionar...
متن کامل